Vertex Magic Total Labelings of Complete Graphs
نویسنده
چکیده
The study of graph labeling has focussed on finding classes of graphs which admits a particular type of labeling. In this paper we consider a particular class of graph which admits a vertex magic total labeling. The class we considered here is the class of complete graphs, Kn . A vertex magic labeling of a graph is a bijection which maps the vertices V and edges E to the integers from 1, 2, 3, · · · , |V | + |E| , such that the sum of label on a vertex and labels of its incident edges is a constant, independent of the choice of the vertex. We make use of technique of generating magic squares and ideas from graph factorization in our construction.
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملVertex-Magic Total Labelings of Complete Bipartite Graphs
A vertex-magic total labeling on a graph G is a one-to-one map λ from V (G) ∪E(G) onto the integers 1, 2, · · · , |V (G) ∪E(G)| with the property that, given any vertex x, λ(x) + ∑ y∼x λ(y) = k for some constant k. In this paper we completely determine which complete bipartite graphs have vertex-magic total labelings.
متن کاملVertex Magic Total Labelings of Graphs
A vertex magic total labeling of a graph with v vertices and e edges is de ned as a one to one map taking the vertices and edges onto the integers v e with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex Properties of these labelings are studied It is shown how to construct labelings for several families o...
متن کاملMagic Labelings on Cycles and Wheels
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we extend the enumeration of the total labelings on these classes of graphs.
متن کاملDistance magic labelings of graphs
As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...
متن کامل